Modular Arithmetic and Calculus Problems in #P
نویسنده
چکیده
has polynomial time complexity if the integers are supplied in unary radix. We show that if the input is supplied in binary (or higher) radix, then this problem is in #P and is actually the counting version of the Partition problem. We also state additional properties of the Partition problem following our analysis. In particular, we show that deciding whether definite integrals are zero or infinite is NP-Complete under some settings. We also show how to count all integer partitions that are divisible by a given factor, and how it is related to the Trapezoid rule from numerical analysis.
منابع مشابه
Modular: The Super Computer
This article is deals with the history modular arithmetic, based on the rest classes calculus system «Restklassenarithmetik» (RCCS), or Modular Arithmetic, regarding its creation and development in the USSR. Characteristics of the USSR first modular super-computers: “Т-340А”, “К340А”, “Diamond (Алмаз)” and “5E53” and their development history are briefly considered. A brief analysis of the weak...
متن کاملSimultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point arithmetic. The modular polynomials are converted into integers using Kronecker substitution (evaluation at a sufficiently large integer). With some control ...
متن کاملNON-POLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS
A Class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Convergence anal...
متن کاملPruning with Modular Arithmetic in NP problems
Using modular arithmetic we introduce a simple bound which applies to a wide range of bin-packing like problems. This bound must hold if a problem is to be soluble. When it fails, search can therefore be pruned. We show the value of such pruning in a greedy backtracking algorithm for number partitioning problems. As the bound can be used when solving inexact as well as exact partitioning proble...
متن کاملAn analytic study on the Euler-Lagrange equation arising in calculus of variations
The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...
متن کامل